Dominating set - PDFSEARCH.IO - Document Search Engine

Dominating set
Results: 145

#	Item
91	Theory of Computing Systems manuscript No. (will be inserted by the editor) Constant Thresholds Can Make Target Set Selection Tractable Morgan Chopin∗ · Andr´ Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2013-09-10 04:14:52 Graph operations Path decomposition Vertex cover Feedback vertex set Clique Kernelization Dominating set Tree decomposition Vertex Graph theory Theoretical computer science NP-complete problems
92	New Races in Parameterized Algorithmics Christian Komusiewicz and Rolf Niedermeier Institut f¨ ur Softwaretechnik und Theoretische Informatik, TU Berlin, Germany {christian.komusiewicz,rolf.niedermeier}@tu-berlin.de Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2012-08-07 06:26:48 NP-complete problems Parameterized complexity Kernelization Path decomposition Vertex cover Feedback vertex set Dominating set Tree decomposition Clique Graph theory Theoretical computer science Mathematics
93	Approximating k-center in planar graphs David Eisenstat∗ Philip N. Klein∗ Abstract Add to Reading List Source URL: www.di.ens.fr Language: English - Date: 2013-10-10 10:36:31 NP-complete problems Graph operations Dominating set Neighbourhood Tree decomposition Tree Planar graph Graph Degree Graph theory Mathematics Theoretical computer science
94	A Tight Combinatorial Algorithm for Submodular Maximization Subject to a Matroid Constraint Yuval Filmus Department of Computer Science University of Toronto Add to Reading List Source URL: www.cs.toronto.edu Language: English - Date: 2012-08-16 03:01:30 Matroid Randomized rounding Auxiliary function Euclidean algorithm Dominating set Mathematics Submodular set function Matroid theory
95	Parameterized Complexity for the Database Theorist Martin Grohe Division of Informatics, University of Edinburgh, Edinburgh EH9 3JZ, Scotland, UK. Email: 1 . Introduction Add to Reading List Source URL: homepages.inf.ed.ac.uk Language: English - Date: 2006-07-04 06:02:43 NP-complete problems Analysis of algorithms Complexity classes Parameterized complexity Graph coloring Dominating set FO Time complexity Tree decomposition Theoretical computer science Computational complexity theory Applied mathematics
96	Parameterized Complexity-News The Newsletter of the Parameterized Complexity Community Volume 2, NovemberWelcome Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-09-04 06:03:49 NP-complete problems Analysis of algorithms Parameterized complexity Graph coloring Bidimensionality Kernelization Dominating set Branch-decomposition Vertex cover Theoretical computer science Graph theory Computational complexity theory
97	Welcome • September 10th (Fri) – Final version due Frances Rosamond, Editor Welcome to the Parameterized Complexity Newsletter. Add to Reading List Source URL: fpt.wdfiles.com Language: English - Date: 2012-09-17 05:19:59 NP-complete problems Analysis of algorithms Complexity classes Parameterized complexity Kernelization Bidimensionality Feedback vertex set Dominating set Vertex cover Theoretical computer science Computational complexity theory Applied mathematics
98	Newsletter of the PC Community NovemberWelcome Bergen Algorithmics Wins Big Add to Reading List Source URL: fpt.wdfiles.com Language: English - Date: 2012-09-17 04:47:38 NP-complete problems Analysis of algorithms Parameterized complexity Graph operations Graph coloring Bidimensionality Kernelization Clique Dominating set Theoretical computer science Graph theory Computational complexity theory
99	A note on sampling scale-free graphs K. M. Briggs BT Research, Adastral Park Martlesham UK IP5 3RE 2007 November 19 16:47 In Proc. Nat. Acad. Sci. 102, ), Stumpf et al. have shown Add to Reading List Source URL: keithbriggs.info Language: English - Date: 2008-01-02 07:43:53 Analytic number theory Meromorphic functions Degree distribution Scale-free network Riemann zeta function Degree Random graphs NP-complete problems Dominating set Graph theory Mathematics Mathematical analysis
100	Distributed Connected Dominating Set Techniques for Energy-Efficient Topology Control in Wireless Sensor Networks A thesis submitted for the degree of Add to Reading List Source URL: titania.ctie.monash.edu.au Language: English - Date: 2013-12-23 05:00:15 Network topology Topology control Electronics Electromagnetism Algorithm Topology ANT Wireless sensor network Technology Wireless networking